toughness of the networks with maximum connectivity

Authors

d. moazzami

university of tehran, college of engineering, department of engineering science

abstract

the stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. as the network begins losing links or nodes, eventually there is a loss in its effectiveness. thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible reconstruction of the network. for any fixed integers n,p with p ≥ n + 1, harary constructed classes of graphs hn,p that are n-connected with the minimum number of edges. thus harary graphs are examples of graphs with maximum connectivity. this property makes them useful to network designers and thus it is of interest to study the behavior of other stability parameters for the harary graphs. in this paper we study the toughness of the third case of the harary graphs.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Toughness of the Networks with Maximum Connectivity

The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...

full text

Tricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity

Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...

full text

determinant of the hankel matrix with binomial entries

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

15 صفحه اول

the evaluation of language related engagment and task related engagment with the purpose of investigating the effect of metatalk and task typology

abstract while task-based instruction is considered as the most effective way to learn a language in the related literature, it is oversimplified on various grounds. different variables may affect how students are engaged with not only the language but also with the task itself. the present study was conducted to investigate language and task related engagement on the basis of the task typolog...

15 صفحه اول

Bipartite Graphs and Digraphs with Maximum Connectivity

Recently, some sufficient conditions for a digraph to have maximum connectivity or high superconnectivity have been given in terms of a new parameter which can be thought of as a generalization of the girth of a graph. In this paper similar results are derived for bipartite digraphs and graphs showing that, in this case, all the known conditions can be improved. As a corollary, it is shown that...

full text

My Resources

Save resource for easier access later


Journal title:
journal of algorithms and computation

جلد ۴۶، شماره ۱، صفحات ۵۱-۷۱

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023